Interaction nets and term-rewriting systems
نویسندگان
چکیده
منابع مشابه
Interaction Nets and Term-Rewriting Systems
Term rewriting systems provide a framework in which it is possible to specify and program in a traditional syntax (oriented equations). Interaction nets, on the other hand, provide a graphical syntax for the same purpose, but can be regarded as being closer to an implementation since the reduction process is local and asynchronous, and all the operations are made explicit, including discarding ...
متن کاملInteraction Nets and Term Rewriting Systems (Extended Abstract)
Term rewriting systems provide a framework in which it is possible to specify and program in a one-dimensional syntax. Interaction nets, on the other hand, provide a graphical syntax for the same purpose. In this paper, our aim is to bridge the gap between the above formalisms by showing how to understand interaction nets in a term rewriting framework. This allows us to transfer results from on...
متن کاملFrom Term Rewriting to Generalised Interaction Nets
In this paper we present a system of interaction that gener-alises Lafont's interaction nets by allowing computation in several nets in parallel and communication through a state. This framework allows us to represent large classes of term rewriting systems, genuine parallel functions, non-determinism, communication, sharing, and hence can be used to code features from Standard ML and Concurren...
متن کاملTerm Rewriting as Interaction Nets plus Hyperedge Replacement
In this paper we show that an arbitrary term rewriting system can be simulated by a set of hypergraph rewrite rules that can be split into two parts. The rst part is a set of hyperedge replacement rules, one for each term rewrite rule. The second part is equivalent to an interaction net.
متن کاملIn-place Graph Rewriting with Interaction Nets
An algorithm is in-place, or runs in-situ, when it does not need any additional memory to execute beyond a small constant amount. There are many algorithms that are efficient because of this feature, therefore it is an important aspect of an algorithm. In most programming languages, it is not obvious when an algorithm can run in-place, and moreover it is often not clear that the implementation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1998
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(97)00082-0